Measuring In nite Relations
نویسندگان
چکیده
We deene a new aggregation operator n for constraint databases that makes it possible to measure innnite subsets of the n-dimensional space deened by constraints. We show that it is well deened for real linear arithmetic constraints and integer linear arithmetic constraints together with periodicity constraints. We also show that relational algebra augmented with n is closed in the real case and, under certain restrictions, in the integer case as well.
منابع مشابه
On the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملSome Thoughts on COMMUTATION RELATIONS and MEASUREMENT ACCURACY
We show that measuring the trajectories of charged particles to nite accuracy leads to the commutation relations needed for the derivation of the free space Maxwell equations using the discrete ordered calculus (DOC). We note that the nite step length derivation of the discrete di erence version of the single particle Dirac equation implies the discrete version of the p; q commutation relations...
متن کاملCLASSIFYING FUZZY SUBGROUPS OF FINITE NONABELIAN GROUPS
In this paper a rst step in classifying the fuzzy subgroups of a nite nonabelian group is made. We develop a general method to count the number of distinct fuzzy subgroups of such groups. Explicit formulas are obtained in the particular case of dihedral groups.
متن کاملComputing Simulations on Finite and In nite Graphs y
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the re nement and veri cation of reactive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For e ectively presented in nite graphs, we present a symbolic similarity-checking proc...
متن کامل